Feature preserving Delaunay mesh generation from 3D multi-material images
نویسندگان
چکیده
منابع مشابه
Feature preserving Delaunay mesh generation from 3D multi-material images
Generating realistic geometric models from 3D segmented images is an important task in many biomedical applications. Segmented 3D images impose particular challenges for meshing algorithms because they contain multimaterial junctions forming features such as surface patches, edges and corners. The resulting meshes should preserve these features to ensure the visual quality and the mechanical so...
متن کاملMesh Generation from 3D Multi-material Images
The problem of generating realistic computer models of objects represented by 3D segmented images is important in many biomedical applications. Labelled 3D images impose particular challenges for meshing algorithms because multi-material junctions form features such as surface pacthes, edges and corners which need to be preserved into the output mesh. In this paper, we propose a feature preserv...
متن کاملFeature-Preserving, Multi-material Mesh Generation Using Hierarchical Oracles
This paper presents a method for meshing multi-material domains with additional features curves. This requirement arises for instance in situations where smooth objects (e.g. anatomical structures) are combined with technical objects (e.g. implants, surgical screws). Our approach avoids the tedious process of generating a single consistent input surface by means of an implicit representation, c...
متن کاملFeature Preserving Mesh Generation from 3D Point Clouds
We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the covariance matrices of Voronoi cells, we first extract from the point cloud a set of sharp features. Our algorithm also runs on the input point cloud a reconstruction process, such as Poisson reconstruction, providing an i...
متن کاملFully Incremental 3D Delaunay Refinement Mesh Generation
The classical meshing problem is to construct a triangulation of a region that conforms to the boundary, is as coarse as possible, and is constructed from simplices having bounded aspect ratio. In this paper we present a fully incremental Delaunay re nement algorithm. The algorithm is an extension of one introduced by Ruppert. The algorithm is fully incremental in the sense that it does not nee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2009
ISSN: 0167-7055,1467-8659
DOI: 10.1111/j.1467-8659.2009.01522.x